Stateless Model Checking Under a Reads-Value-From Equivalence

Abstract Stateless model checking (SMC) is one of the standard approaches to verification concurrent programs. As scheduling non-determinism creates exponentially large spaces thread interleavings, SMC attempts partition this space into equivalence classes and explore only a few representatives from each class. The efficiency approach depends on two factors: (a) coarseness partitioning, (b) time generate in For reason, search for coarse partitionings that are efficiently explorable an active research challenge. In work we present $${\text {RVF-SMC}}$$ RVF-SMC , new algorithm uses novel reads-value-from (RVF) partitioning. Intuitively, interleavings deemed equivalent if they agree value obtained read event, events induce consistent causal orderings between them. RVF partitioning provably coarser than recent based Mazurkiewicz “reads-from” partitionings. Our experimental evaluation reveals quite often very effective equivalence, as underlying other approaches. Moreover, generates efficiently, reduction met with significant speed-ups task.